A An Implicit Characterization of PSPACE
نویسندگان
چکیده
MARCO GABOARDI, Dipartimento di Scienze dell’Informazione, Università degli Studi di Bologna INRIA Focus team Mura Anteo Zamboni 7, 40127 Bologna, Italy, [email protected] JEAN-YVES MARION, Nancy-University, ENSMN-INPL, Loria B.P. 239, 54506 Vandoeuvre-lès-Nancy, France, [email protected] SIMONA RONCHI DELLA ROCCA, Dipartimento di Informatica, Università degli Studi di Torino Corso Svizzera 185, 10149 Torino, Italy, [email protected]
منابع مشابه
Characterizing PSPACE with pointers
This paper gives an implicit characterization of the class of functions computable in polynomial space by deterministic Turing machines — Pspace. It gives an inductive characterization of Pspace with no ad-hoc initial functions and with only one recursion scheme. The main novelty of this characterization is the use of pointers (also called path information) to reach Pspace. The presence of the ...
متن کاملSharper Results on the Expressive Power of Generalized Quantifiers
In this paper we improve on some results of 3] and extend them to the setting of implicit deenability. We show a strong necessary condition on classes of structures on which PSPACE can be captured by extending PFP with a nite set of generalized quantiiers. For IFP and PTIME the limitation of expressive power of generalized quantiiers is shown only on some speciic nontrivial classes. These resul...
متن کاملObservation of implicit complexity by non confluence
We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of cons-free programs, the class of programs with an interpretation, and the class of programs with a quasi-interpretation together with a termination proof by ...
متن کاملGame Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking ...
متن کاملThe Implicit Computational Complexity of Imperative Programming Languages
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit computational complexity, i.e. the theory of predicative recursion, tiered definition schemes, etcetera. We extend and modify this theory to work in a context of imperative programming languages, and characterise complexity classes like P, linspace, pspace and the classes in the Grzegorczyk hiearch...
متن کامل